<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>Data Structures for Sets and Graphs: BitMapSortedGraph&lt; T &gt; Class Template Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">Data Structures for Sets and Graphs
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.1.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
      <li><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="annotated.html"><span>Class&#160;List</span></a></li>
      <li><a href="classes.html"><span>Class&#160;Index</span></a></li>
      <li><a href="inherits.html"><span>Class&#160;Hierarchy</span></a></li>
      <li><a href="functions.html"><span>Class&#160;Members</span></a></li>
    </ul>
  </div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark">&#160;</span>Macros</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

</div><!-- top -->
<div class="header">
  <div class="summary">
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pri-methods">Private Member Functions</a> &#124;
<a href="#pri-attribs">Private Attributes</a>  </div>
  <div class="headertitle">
<div class="title">BitMapSortedGraph&lt; T &gt; Class Template Reference</div>  </div>
</div><!--header-->
<div class="contents">

<p><code>#include &lt;<a class="el" href="Graph_8h_source.html">Graph.h</a>&gt;</code></p>
<div class="dynheader">
Inheritance diagram for BitMapSortedGraph&lt; T &gt;:</div>
<div class="dyncontent">
<div class="center"><img src="classBitMapSortedGraph__inherit__graph.png" border="0" usemap="#BitMapSortedGraph_3_01T_01_4_inherit__map" alt="Inheritance graph"/></div>
<map name="BitMapSortedGraph_3_01T_01_4_inherit__map" id="BitMapSortedGraph_3_01T_01_4_inherit__map">
<area shape="rect" id="node2" href="classBitMapGraph.html" title="BitMapGraph\&lt; T \&gt;" alt="" coords="24,160,155,189"/><area shape="rect" id="node4" href="classBitMapDiGraph.html" title="BitMapDiGraph\&lt; T \&gt;" alt="" coords="19,83,160,112"/><area shape="rect" id="node6" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers." alt="" coords="39,5,140,35"/></map>
<center><span class="legend">[<a href="graph_legend.html">legend</a>]</span></center></div>
<div class="dynheader">
Collaboration diagram for BitMapSortedGraph&lt; T &gt;:</div>
<div class="dyncontent">
<div class="center"><img src="classBitMapSortedGraph__coll__graph.png" border="0" usemap="#BitMapSortedGraph_3_01T_01_4_coll__map" alt="Collaboration graph"/></div>
<map name="BitMapSortedGraph_3_01T_01_4_coll__map" id="BitMapSortedGraph_3_01T_01_4_coll__map">
<area shape="rect" id="node2" href="classBitMapGraph.html" title="BitMapGraph\&lt; T \&gt;" alt="" coords="36,261,167,291"/><area shape="rect" id="node4" href="classBitMapDiGraph.html" title="BitMapDiGraph\&lt; T \&gt;" alt="" coords="31,181,172,211"/><area shape="rect" id="node6" href="classDiGraph.html" title="A directed graph with the vertices being natural numbers." alt="" coords="51,101,152,131"/><area shape="rect" id="node8" href="classDirectlyAddressedSetFactory.html" title="DirectlyAddressedSetFactory" alt="" coords="5,5,197,35"/></map>
<center><span class="legend">[<a href="graph_legend.html">legend</a>]</span></center></div>

<p><a href="classBitMapSortedGraph-members.html">List of all members.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a29635273ad1866426fee05b5d45f6505"><td class="memItemLeft" align="right" valign="top">virtual&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classBitMapSortedGraph.html#a29635273ad1866426fee05b5d45f6505">~BitMapSortedGraph</a> ()</td></tr>
<tr class="memitem:a5db18bc9cff675fabe052ee112a03921"><td class="memItemLeft" align="right" valign="top">virtual long&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classBitMapSortedGraph.html#a5db18bc9cff675fabe052ee112a03921">vertex</a> (long i)</td></tr>
<tr class="memdesc:a5db18bc9cff675fabe052ee112a03921"><td class="mdescLeft">&#160;</td><td class="mdescRight">Return the i-th element of the universe.  <a href="#a5db18bc9cff675fabe052ee112a03921"></a><br/></td></tr>
<tr class="memitem:ad93702dada9aa747572e5554b330fe98"><td class="memItemLeft" align="right" valign="top">virtual bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classBitMapSortedGraph.html#ad93702dada9aa747572e5554b330fe98">hasEdge</a> (long i, long j) const </td></tr>
<tr class="memdesc:ad93702dada9aa747572e5554b330fe98"><td class="mdescLeft">&#160;</td><td class="mdescRight">Queries for an edge.  <a href="#ad93702dada9aa747572e5554b330fe98"></a><br/></td></tr>
<tr class="memitem:abbc0b39305b3f5f670e0a79040dc0870"><td class="memItemLeft" align="right" valign="top">virtual void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classBitMapSortedGraph.html#abbc0b39305b3f5f670e0a79040dc0870">addEdge</a> (long i, long j)</td></tr>
<tr class="memdesc:abbc0b39305b3f5f670e0a79040dc0870"><td class="mdescLeft">&#160;</td><td class="mdescRight">Adds an edge between the two specified vertices (optional operation).  <a href="#abbc0b39305b3f5f670e0a79040dc0870"></a><br/></td></tr>
<tr class="memitem:a8065bb391ab284fdd66fcf1f950636c4"><td class="memItemLeft" align="right" valign="top">virtual void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classBitMapSortedGraph.html#a8065bb391ab284fdd66fcf1f950636c4">delEdge</a> (long i, long j)</td></tr>
<tr class="memdesc:a8065bb391ab284fdd66fcf1f950636c4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Deletes the edge defined by the two specified vertices (optional operation).  <a href="#a8065bb391ab284fdd66fcf1f950636c4"></a><br/></td></tr>
<tr class="memitem:ae867ca531045c571937871689ca0bf62"><td class="memItemLeft" align="right" valign="top">virtual void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classBitMapSortedGraph.html#ae867ca531045c571937871689ca0bf62">flipEdge</a> (long i, long j)</td></tr>
<tr class="memdesc:ae867ca531045c571937871689ca0bf62"><td class="mdescLeft">&#160;</td><td class="mdescRight">Swap the edge represented by the specified ordered pair (optional operation).  <a href="#ae867ca531045c571937871689ca0bf62"></a><br/></td></tr>
<tr class="memitem:a6285279f5e46b1c64b65d444db9ed163"><td class="memItemLeft" align="right" valign="top">virtual <a class="el" href="classDiGraph.html">DiGraph</a>&lt; T &gt; *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classBitMapSortedGraph.html#a6285279f5e46b1c64b65d444db9ed163">clone</a> () const </td></tr>
<tr class="memdesc:a6285279f5e46b1c64b65d444db9ed163"><td class="mdescLeft">&#160;</td><td class="mdescRight">Create a clone of the current graph.  <a href="#a6285279f5e46b1c64b65d444db9ed163"></a><br/></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2><a name="pri-methods"></a>
Private Member Functions</h2></td></tr>
<tr class="memitem:ac7f2da1a560e15afe4a59f7057ecb24a"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classBitMapSortedGraph.html#ac7f2da1a560e15afe4a59f7057ecb24a">BitMapSortedGraph</a> (const int ar, const char *aR, <a class="el" href="classDiGraph.html">DiGraph</a>&lt; T &gt; *bg)</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2><a name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:a8ecab39ea1c14625338b285cd0660bf5"><td class="memItemLeft" align="right" valign="top">int *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classBitMapSortedGraph.html#a8ecab39ea1c14625338b285cd0660bf5">R</a></td></tr>
<tr class="memdesc:a8ecab39ea1c14625338b285cd0660bf5"><td class="mdescLeft">&#160;</td><td class="mdescRight">mapping of vertices  <a href="#a8ecab39ea1c14625338b285cd0660bf5"></a><br/></td></tr>
</table>
<hr/><h2>Constructor &amp; Destructor Documentation</h2>
<a class="anchor" id="ac7f2da1a560e15afe4a59f7057ecb24a"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classBitMapSortedGraph.html">BitMapSortedGraph</a>&lt; T &gt;::<a class="el" href="classBitMapSortedGraph.html">BitMapSortedGraph</a> </td>
          <td>(</td>
          <td class="paramtype">const int&#160;</td>
          <td class="paramname"><em>ar</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const char *&#160;</td>
          <td class="paramname"><em>aR</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="classDiGraph.html">DiGraph</a>&lt; T &gt; *&#160;</td>
          <td class="paramname"><em>bg</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

</div>
</div>
<a class="anchor" id="a29635273ad1866426fee05b5d45f6505"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">virtual <a class="el" href="classBitMapSortedGraph.html">BitMapSortedGraph</a>&lt; T &gt;::~<a class="el" href="classBitMapSortedGraph.html">BitMapSortedGraph</a> </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

</div>
</div>
<hr/><h2>Member Function Documentation</h2>
<a class="anchor" id="abbc0b39305b3f5f670e0a79040dc0870"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="classBitMapSortedGraph.html">BitMapSortedGraph</a>&lt; T &gt;::addEdge </td>
          <td>(</td>
          <td class="paramtype">long&#160;</td>
          <td class="paramname"><em>i</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">long&#160;</td>
          <td class="paramname"><em>j</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Adds an edge between the two specified vertices (optional operation). </p>
<p>Adds the second specified vertex to the neighborhood of the first vertex. A further call to hasEdge(firstVertex, secondVertex) returns <code>true</code> unless <a class="el" href="classBitMapSortedGraph.html#a8065bb391ab284fdd66fcf1f950636c4" title="Deletes the edge defined by the two specified vertices (optional operation).">delEdge()</a> or <a class="el" href="classBitMapDiGraph.html#a46bdc8019056d94bd29f0f56ccd5bd6b" title="Removes all possible edges (optional operation).">delAllEdges()</a> is invoked to delete the edge defined by the specified vertices.</p>
<p>An invocation of this method does not affect the result of hasEdge(secondVertex, firstVertex).</p>
<p>If one of the specified elements is out of the universe an error will occur.</p>
<dl class="params"><dt>Parameters:</dt><dd>
  <table class="params">
    <tr><td class="paramname">i</td><td>the first vertex </td></tr>
    <tr><td class="paramname">j</td><td>the second vertex </td></tr>
  </table>
  </dd>
</dl>

<p>Reimplemented from <a class="el" href="classBitMapDiGraph.html#a4d7f07667c3f2bdb8d54caf3c7ff80a4">BitMapDiGraph&lt; T &gt;</a>.</p>

</div>
</div>
<a class="anchor" id="a6285279f5e46b1c64b65d444db9ed163"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classDiGraph.html">DiGraph</a>&lt; T &gt; * <a class="el" href="classBitMapSortedGraph.html">BitMapSortedGraph</a>&lt; T &gt;::clone </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Create a clone of the current graph. </p>
<p>Create a clone of the current graph, with the same number of edges, the same vertex set and the same edges. It is implemented using the method clone to each line of the adjacency matrix.</p>
<dl class="section return"><dt>Returns:</dt><dd>a copy of the current graph. </dd></dl>

<p>Reimplemented from <a class="el" href="classBitMapDiGraph.html#a26cc16171db0a21a5f1d4d0c1bc4ed32">BitMapDiGraph&lt; T &gt;</a>.</p>

</div>
</div>
<a class="anchor" id="a8065bb391ab284fdd66fcf1f950636c4"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="classBitMapSortedGraph.html">BitMapSortedGraph</a>&lt; T &gt;::delEdge </td>
          <td>(</td>
          <td class="paramtype">long&#160;</td>
          <td class="paramname"><em>i</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">long&#160;</td>
          <td class="paramname"><em>j</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Deletes the edge defined by the two specified vertices (optional operation). </p>
<p>Deletes the second specified vertex from the neighborhood of the first vertex. A further call to hasEdge(firstVertex, secondVertex) returns <code>false</code> unless <a class="el" href="classBitMapSortedGraph.html#abbc0b39305b3f5f670e0a79040dc0870" title="Adds an edge between the two specified vertices (optional operation).">addEdge()</a> or <a class="el" href="classBitMapDiGraph.html#a69c90703a260e27c54345b9d1706583f" title="Adds all possible edges (optional operation).">addAllEdges()</a> is invoked to add the edge defined by the specified vertices.</p>
<p>An invocation of this method does not affect the result of hasEdge(secondVertex, firstVertex).</p>
<p>If one of the specified elements is out of the universe an error will occur.</p>
<dl class="params"><dt>Parameters:</dt><dd>
  <table class="params">
    <tr><td class="paramname">i</td><td>the first vertex </td></tr>
    <tr><td class="paramname">j</td><td>the second vertex </td></tr>
  </table>
  </dd>
</dl>

<p>Reimplemented from <a class="el" href="classBitMapDiGraph.html#a51ee8382afd89facce0645c182f7ad5f">BitMapDiGraph&lt; T &gt;</a>.</p>

</div>
</div>
<a class="anchor" id="ae867ca531045c571937871689ca0bf62"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="classBitMapSortedGraph.html">BitMapSortedGraph</a>&lt; T &gt;::flipEdge </td>
          <td>(</td>
          <td class="paramtype">long&#160;</td>
          <td class="paramname"><em>i</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">long&#160;</td>
          <td class="paramname"><em>j</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Swap the edge represented by the specified ordered pair (optional operation). </p>
<p>If the edge represented by the specified ordered pair is in the graph, it will be removed if not it will be added.</p>
<dl class="params"><dt>Parameters:</dt><dd>
  <table class="params">
    <tr><td class="paramname">i</td><td>first vertex </td></tr>
    <tr><td class="paramname">j</td><td>second vertex </td></tr>
  </table>
  </dd>
</dl>

<p>Reimplemented from <a class="el" href="classBitMapDiGraph.html#ac1ee1f14401f6f3ecfb566c7cf1905cf">BitMapDiGraph&lt; T &gt;</a>.</p>

</div>
</div>
<a class="anchor" id="ad93702dada9aa747572e5554b330fe98"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool <a class="el" href="classBitMapSortedGraph.html">BitMapSortedGraph</a>&lt; T &gt;::hasEdge </td>
          <td>(</td>
          <td class="paramtype">long&#160;</td>
          <td class="paramname"><em>i</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">long&#160;</td>
          <td class="paramname"><em>j</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Queries for an edge. </p>
<p>If one of the specified vertices is out of the universe an error will occur.</p>
<dl class="params"><dt>Parameters:</dt><dd>
  <table class="params">
    <tr><td class="paramname">i</td><td>the first vertex </td></tr>
    <tr><td class="paramname">j</td><td>the second vertex</td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns:</dt><dd><code>true</code> if the edge defined by <code>i</code> and <code>j</code>, in this order, is in the edge set, otherwise returns <code>false</code>. </dd></dl>

<p>Reimplemented from <a class="el" href="classBitMapDiGraph.html#a97ae5a91a0f2b01f2fa1284c43045c23">BitMapDiGraph&lt; T &gt;</a>.</p>

</div>
</div>
<a class="anchor" id="a5db18bc9cff675fabe052ee112a03921"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">long <a class="el" href="classBitMapSortedGraph.html">BitMapSortedGraph</a>&lt; T &gt;::vertex </td>
          <td>(</td>
          <td class="paramtype">long&#160;</td>
          <td class="paramname"><em>i</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Return the i-th element of the universe. </p>
<p>Return the element that is in the position i according to the order given to elements in the universe. Usually this value is the position itself, but we can reorganize the elements in the vertex set according other order, as in a homorphism.</p>
<p>If the position is bigger than the number of elements in the universe, an error will occur.</p>
<dl class="params"><dt>Parameters:</dt><dd>
  <table class="params">
    <tr><td class="paramname">i</td><td>the specified position.</td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns:</dt><dd>the element in the position i according to the order given to the elements in the vertex set. </dd></dl>

</div>
</div>
<hr/><h2>Member Data Documentation</h2>
<a class="anchor" id="a8ecab39ea1c14625338b285cd0660bf5"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">int* <a class="el" href="classBitMapSortedGraph.html">BitMapSortedGraph</a>&lt; T &gt;::R</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>mapping of vertices </p>

</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>graphs/<a class="el" href="Graph_8h_source.html">Graph.h</a></li>
</ul>
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Wed Nov 21 2012 13:48:51 for Data Structures for Sets and Graphs by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.1.1
</small></address>
</body>
</html>
